Simulation and Optimization by Quantifier Elimination

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simulation and Optimization by Quantifier Elimination

We present a highly optimized method for the elimination of linear variables from a boolean combination of polynomial equations and inequalities. In contrast to the basic method described earlier, the practical applicability of the present method goes far beyond academic examples. The optimization is achieved by various strategies to prune superruous branches in the elimination tree constructed...

متن کامل

Deciding Ellipticity by Quantifier Elimination

We show how ellipticity of partial differential systems in the sense of Douglis and Nirenberg can be decided algorithmically by quantifier elimination on real closed fields. A concrete implementation based on MuPAD and Redlog is presented.

متن کامل

Quantifier Elimination

Quantifier elimination (QE) is a very powerful procedure for problems involving first­order formulas over real fields. The cylindrical algebraic decomposition (CAD) is a technique for the “efficient” im­ plementation of QE, that effectively reduces an seemingly infinite problem into a finite (but potentially large) instance. For much more information about QE and CAD (including a reprint of Tar...

متن کامل

Nonlinear Control System Design by Quantifier Elimination

Many problems in control theory can be formulated as formulae in the first-order theory of real closed fields. In this paper we investigate some of the expressive power of this theory. We consider dynamical systems described by polynomial differential equations subjected to constraints on control and system variables and show how to formulate questions in the above framework which can be answer...

متن کامل

Quantifier Elimination by Lazy Model Enumeration

We propose a quantifier elimination scheme based on nested lazy model enumeration through SMT-solving, and projections. This scheme may be applied to any logic that fulfills certain conditions; we illustrate it for linear real arithmetic. The quantifier elimination problem for linear real arithmetic is doubly exponential in the worst case, and so is our method. We have implemented it and benchm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Symbolic Computation

سال: 1997

ISSN: 0747-7171

DOI: 10.1006/jsco.1997.0122